On the free resolution induced by a Pommaret basis
نویسندگان
چکیده
We combine the theory of Pommaret bases with a (slight generalisation of a) recent construction by Sköldberg based on discrete Morse theory. This combination allows us the explicit determination of a (generally non-minimal) free resolution for a graded polynomial module with the computation of only one Pommaret basis. If only the Betti numbers are needed, one can considerably simplify the computations by determining only the constant part of the differential. For the special case of a quasi-stable monomial ideal, we show that the induced resolution is a mapping cone resolution. We present an implementation within the CoCoALib and test it with some common benchmark ideals.
منابع مشابه
Numerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملJanet Bases and Resolutions in CoCoALib
Recently, the authors presented a novel approach to computing resolutions and Betti numbers using Pommaret bases. For Betti numbers, this algorithm is for most examples much faster than the classical methods (typically by orders of magnitude). As the problem of δ-regularity often makes the determination of a Pommaret basis rather expensive, we extend here our algorithm to Janet bases. Although ...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملThe Computation of Grobner Bases Using an Alternative Algorithm
When Zharkov and Blinkov ([ZB93]) applied the classical ideas of involutive systems originating from the theory of partial dierential equations (c.f. [Ja29],[Po78]) to the computation of Gr obner bases (c.f. [Bu65],[BW93]) their theory seemed to be a rather marginal concept. But due to the opportunity of gaining a faster version for one of the most frequently applied algorithms the method came...
متن کاملEffective Genericity, Δ-regularity and Strong Noether Position
We show that the concept of strong Noether position for a polynomial ideal I CP is equivalent to δ-regularity and thus related to Pommaret bases. In particular, we provide explicit Pommaret bases for two of the ideal sequences used in Hashemi’s definition of strong Noether position and alternative proofs for a number of his statements. Finally, we show that one consequence of δ-regularity is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 2015